package 力扣.树.层序遍历;

// Definition for a binary tree node.
class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; }
}
//public class 二叉搜索树绝对值530 {
//    public int getMinimumDifference(TreeNode root) {
//        for (; root!=null ;) {
//
//        }
//    }
//}
